Algorithm FIRE—Feynman Integral REduction
نویسندگان
چکیده
منابع مشابه
Algorithm FIRE — Feynman Integral REduction
The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over loop momenta when possible. Currently it is being used in complicated three-loop calculations. Supported by RFBR grant 08-02-01451-a and DFG throug...
متن کاملMinkowski Reduction of Integral Matrices
In 1905 Hermann Minkowski introduced his theory of reduction of positive definite quadratic forms. Recently, Hans J. Zassenhaus has suggested that this theory can be applied to the problem of row reduction of matrices of integers. Computational investigations have shown that for matrices with more columns than rows, the number of steps required for reduction decreases drastically. In this paper...
متن کاملQuantum Path-Integral qPATHINT Algorithm
Received: November 10, 2017 Revised: December 12, 2017 Accepted: December 12, 2017 Abstract: Background: A path-integral algorithm, PATHINT used previously for several systems, has been generalized from 1 dimension to N dimensions, and from classical to quantum systems into qPATHINT. Previous publications applied qPATHINT to two systems developed by the author, in neocortical interactions and f...
متن کاملReduze - Feynman integral reduction in C++
Reduze is a computer program for reducing Feynman integrals to master integrals employing a Laporta algorithm. The program is written in C++ and uses classes provided by the GiNaC library to perform the simplifications of the algebraic prefactors in the system of equations. Reduze offers the possibility to run reductions in parallel. Catalogue identifier: AEGEv10ProgramsummaryURL : http : //cpc...
متن کاملA KZ Reduction Algorithm
The Korkine-Zolotareff (KZ) reduction is one of the often used reduction strategies for decoding lattices. A KZ reduction algorithm involves solving shortest vector problems (SVPs) and basis expansion. In this paper, first we improve the commonly used Schnorr-Euchner search strategy for solving SVPs. Then, we derive upper bounds on the magnitudes of the entries of any solution of a SVP when its...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2008
ISSN: 1029-8479
DOI: 10.1088/1126-6708/2008/10/107